//
// Created by 下次一定 on 2021/9/16.
//
/*
 *
 * */

#include <iostream>
#include <cstring>
#include <algorithm>

using namespace std;

const int N = 100010, M = N * 2;

int n, m;
//h 链表头   e 边   ne下一个节点  idx
int h[N], e[M], ne[M], idx;
bool st[N];

int ans = N;

// a b 连成一个边
void add(int a, int b) {
    e[idx] = b;
    ne[idx] = h[a];
    h[a] = idx++;
}

// 返回以u为根的点数大小
int dfs(int u) {
    st[u] = true;

    //当前子树的大小   res 最大值
    int sum = 1, res = 0;
    for (int i = h[u]; i != -1; i = ne[i]) {
        int j = e[i];
        if (!st[j]) {
            int s = dfs(j);
            res = max(res, s);
            sum += s;
        }
    }
    res = max(res, n - sum);

    ans = min(ans, res);
    return sum;
}

int main() {
    cin >> n;
    memset(h, -1, sizeof h);

    for (int i = 0; i < n - 1; i++) {
        int a, b;
        cin >> a >> b;
        add(a, b);
        add(b, a);
    }
    dfs(1);

    cout << ans << endl;

}

